A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
Identifieur interne : 000188 ( France/Analysis ); précédent : 000187; suivant : 000189A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
Auteurs : Djamel Gaceb [France] ; Véronique Eglin [France] ; Frank Lebourgeois [France] ; Hubert Emptoz [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.
Url:
DOI: 10.1007/978-3-540-74260-9_113
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B42
- to stream Istex, to step Curation: 000B27
- to stream Istex, to step Checkpoint: 000921
- to stream Main, to step Merge: 000F19
- to stream Main, to step Curation: 000F06
- to stream Main, to step Exploration: 000F06
- to stream France, to step Extraction: 000188
Links to Exploration step
ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name></author><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name></author><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name></author><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-74260-9_113</idno><idno type="url">https://api.istex.fr/document/CED316FA7D2BB955090D4644D37E7BF99536B208/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B42</idno><idno type="wicri:Area/Istex/Curation">000B27</idno><idno type="wicri:Area/Istex/Checkpoint">000921</idno><idno type="wicri:doubleKey">0302-9743:2007:Gaceb D:a:new:pyramidal</idno><idno type="wicri:Area/Main/Merge">000F19</idno><idno type="wicri:Area/Main/Curation">000F06</idno><idno type="wicri:Area/Main/Exploration">000F06</idno><idno type="wicri:Area/France/Extraction">000188</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring</title><author><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name><affiliation><wicri:noCountry code="subField">Cedex</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name><affiliation><wicri:noCountry code="subField">Cedex</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name><affiliation><wicri:noCountry code="subField">Cedex</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name><affiliation><wicri:noCountry code="subField">Cedex</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">CED316FA7D2BB955090D4644D37E7BF99536B208</idno><idno type="DOI">10.1007/978-3-540-74260-9_113</idno><idno type="ChapterID">113</idno><idno type="ChapterID">Chap113</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: An efficient sorting mail system is mainly based on an accurate optical recognition of the envelopes addresses. However, the location of the address block (ABL) should be done before the OCR recognition process. The location step is very crucial as it has a great impact on the global performance of the system. Actually, a good location step leads to a better recognition rate. The limit of current methods depends on modular linear architectures used for ABL. Their performances depend on each independent module performance. We are presenting in this paper a new approach for ABL based on the hierarchical graph coloring and on the pyramidal organization of data that present the advantage to guarantee a good coherence between different modules and that reduces both the computation time and the rejection rate. The proposed method gives very satisfying rate of 98% of good location on a set of 750 envelope images.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Gaceb, Djamel" sort="Gaceb, Djamel" uniqKey="Gaceb D" first="Djamel" last="Gaceb">Djamel Gaceb</name></noRegion><name sortKey="Eglin, Veronique" sort="Eglin, Veronique" uniqKey="Eglin V" first="Véronique" last="Eglin">Véronique Eglin</name><name sortKey="Emptoz, Hubert" sort="Emptoz, Hubert" uniqKey="Emptoz H" first="Hubert" last="Emptoz">Hubert Emptoz</name><name sortKey="Lebourgeois, Frank" sort="Lebourgeois, Frank" uniqKey="Lebourgeois F" first="Frank" last="Lebourgeois">Frank Lebourgeois</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000188 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000188 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:CED316FA7D2BB955090D4644D37E7BF99536B208
|texte= A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring
}}
| This area was generated with Dilib version V0.6.32. |  |